Modeling Hinting Strategies for Geometry Theorem Proving

نویسندگان

  • Noboru Matsuda
  • Kurt VanLehn
چکیده

This study characterizes hinting strategies used by a human tutor to help students learn geometry theorem proving. Current tutoring systems for theorem proving provide hints that encourage (or force) the student to follow a fixed forward and/or backward chaining strategy. In order to find out if human tutors observed a similar constraint, a study was conducted with students proving geometry theorems individually with a human tutor. When working successfully (without hints), students did not consistently follow the forward and/or backward chaining strategy. Moreover, the human tutor hinted steps that were seldom ones that would be picked by such tutoring systems. Lastly, we discovered a simple categorization of hints that covered 97% of the hints given by the human tutor.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Advanced Geometry Tutor: An intelligent tutor that teaches proof-writing with construction

Two problem solving strategies, forward chaining and backward chaining, were compared to see how they affect students’ learning of geometry theorem proving with construction. In order to determine which strategy accelerates learning the most, an intelligent tutoring system, the Advanced Geometry Tutor, was developed that can teach either strategy while controlling all other instructional variab...

متن کامل

Modeling of ‎I‎nfinite Divisible Distributions Using Invariant and Equivariant Functions

‎Basu’s theorem is one of the most elegant results of classical statistics‎. ‎Succinctly put‎, ‎the theorem says‎: ‎if T is a complete sufficient statistic for a family of probability measures‎, ‎and V is an ancillary statistic‎, ‎then T and V are independent‎. ‎A very novel application of Basu’s theorem appears recently in proving the infinite divisibility of certain statistics‎. ‎In addition ...

متن کامل

Automation of Geometry - Theorem Proving, Diagram Generation, and Knowledge Management

The process of theorem proving in geometry is sophisticated and intelligence-demanding. Mechanizing this process has been the objective of many great scientists , from ancient times to the information era. Scientific breakthroughs and technological advances have been made in the last three decades, which allows us now to automate the process (almost) fully on modern computing devices. The remar...

متن کامل

A short introduction to two approaches in formal verification of security protocols: model checking and theorem proving

In this paper, we shortly review two formal approaches in verification of security protocols; model checking and theorem proving. Model checking is based on studying the behavior of protocols via generating all different behaviors of a protocol and checking whether the desired goals are satisfied in all instances or not. We investigate Scyther operational semantics as n example of this...

متن کامل

The Moment of Truth, in Automatic Theorem Proving in Elementary Geometry

While still being an active field of research, automatic theorem proving in elementary geometry has reached a certain status of maturity. Software and hardware requirements to successfully (and quickly) perform hundreds of interesting examples are now widespread available (such as GEX, Geother, GDI, etc.) Yet, in recent years, a few papers ([BDR],[BFS], [CT1], [CT2]) have repeatedly expressed t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003